Matrices with hierarchical low-rank structures
نویسندگان
چکیده
Matrices with low-rank off-diagonal blocks are a versatile tool to perform matrix compression and to speed up various matrix operations, such as the solution of linear systems. Often, the underlying block partitioning is described by a hierarchical partitioning of the row and column indices, thus giving rise to hierarchical low-rank structures. The goal of this chapter is to provide a brief introduction to these techniques, with an emphasis on linear algebra aspects.
منابع مشابه
Multiresolution Kernel Approximation for Gaussian Process Regression
(a) (b) (c) Figure: (a) In a simple blocked low rank approximation the diagonal blocks are dense (gray), whereas the off-diagonal blocks are low rank. (b) In an HODLR matrix the low rank off-diagonal blocks form a hierarchical structure leading to a much more compact representation. (c) H2 matrices are a refinement of this idea. (a) In simple blocked low rank approximation the diagonal blocks a...
متن کاملCommunication Complexity of the Fast Multipole Method and its Algebraic Variants
A combination of hierarchical tree-like data structures and data access patterns from fast multipole methods and hierarchical low-rank approximation of linear operators from H-matrix methods appears to form an algorithmic path forward for efficient implementation of many linear algebraic operations of scientific computing at the exascale. The combination provides asymptotically optimal computat...
متن کاملRank-deficient submatrices of Fourier matrices
We consider the maximal rank-deficient submatrices of Fourier matrices. We do this by considering a hierarchical subdivision of these matrices into low rank blocks. We also explore some connections with the FFT, and with an uncertainty principle for Fourier transforms over finite Abelian groups.
متن کاملOn the Complexity of the Block Low-Rank Multifrontal Factorization
Matrices coming from elliptic Partial Differential Equations have been shown to have a low-rank property: well defined off-diagonal blocks of their Schur complements can be approximated by low-rank products and this property can be efficiently exploited in multifrontal solvers to provide a substantial reduction of their complexity. Among the possible low-rank formats, the Block Low-Rank format ...
متن کاملOn the Complexity of the Block Low-rank Multifrontal
Matrices coming from elliptic Partial Differential Equations have been shown to have a low4 rank property: well defined off-diagonal blocks of their Schur complements can be approximated by low-rank 5 products and this property can be efficiently exploited in multifrontal solvers to provide a substantial reduction 6 of their complexity. Among the possible low-rank formats, the Block Low-Rank fo...
متن کامل